A convex set with a rich difference
نویسندگان
چکیده
We construct a convex set A with cardinality 2n and the property that an element of difference $$A-A$$ can be represented in n different ways. also show this construction is optimal by proving for any A, maximum possible number representations have $$\lfloor |A|/2 \rfloor$$ .
منابع مشابه
A Level-set Method for Convex Optimization with A
Large-scale constrained convex optimization problems arise in several application 4 domains. First-order methods are good candidates to tackle such problems due to their low iteration 5 complexity and memory requirement. The level-set framework extends the applicability of first-order 6 methods to tackle problems with complicated convex objectives and constraint sets. Current methods 7 based on...
متن کاملOn a convex set with nondifferentiable metric projection
A remarkable example of a nonempty closed convex set in the Euclidean plane for which the directional derivative of the metric projection mapping fails to exist was constructed by A. Shapiro. In this paper, we revisit and modify that construction to obtain a convex set with C boundary which possesses the same property.
متن کاملMinimizing a Convex Cost Closure Set
Many applications in the area of production and statistical estimation are problems of convex optimization subject to ranking constraints that represent a given partial order. This problem – which we call the convex cost closure problem, or (CCC) – is a generalization of the known maximum (or minimum) closure problem and the isotonic regression problem. For a (CCC) problem on n variables and m ...
متن کاملForbidding a set difference of size 1
How large can a family A ⊂ P[n] be if it does not contain A,B with |A \ B| = 1? Our aim in this paper is to show that any such family has size at most 2+o(1) n ( n bn/2c ) . This is tight up to a multiplicative constant of 2. We also obtain similar results for families A ⊂ P[n] with |A\B| 6 = k, showing that they satisfy |A| ≤ Ck nk ( n bn/2c ) , where Ck is a constant depending only on k.
متن کاملA New Almost Difference Set Construction
This paper considers the appearance of almost difference sets in non-abelian groups. While numerous construction methods for these structures are known in abelian groups, little is known about ADSs in the case where the group elements do not commute. This paper presents a construction method for combining abelian difference sets into nonabelian almost difference sets, while also showing that at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica Hungarica
سال: 2022
ISSN: ['0001-5954', '0236-5294', '1588-2632']
DOI: https://doi.org/10.1007/s10474-022-01286-3